Perturbation Analyses for the Cholesky Factorization with Backward Rounding Errors
نویسنده
چکیده
This paper gives perturbation analyses of the Cholesky factorization with the form of perturbations we could expect from the equivalent backward error in A resulting from numerically stable computations. The analyses more accurately reflect the sensitivity of the problem than previous such results. Both numerical results and an analysis show the standard method of symmetric pivoting usually improves the condition of the problem. It follows that the computed R will usually have more accuracy when we use the standard symmetric pivoting strategy.
منابع مشابه
Perturbation Analyses for the Choleskyfactorization with Backward Rounding
This paper gives perturbation analyses for the Cholesky factorization A = R T R of a real symmetric positive deenite matrix A, with the form of perturbations we could expect from the equivalent backward error in A resulting from numerically stable computations on nite precision oating point computers. First-order and rigorous perturbation bounds are are obtained. The analyses more accurately re...
متن کاملRigorous Enclosures of Ellipsoids and Directed Cholesky Factorizations
This paper discusses the rigorous enclosure of an ellipsoid by a rectangular box, its interval hull, providing a convenient preprocessing step for constrained optimization problems. A quadratic inequality constraint with a positive definite Hessian defines an ellipsoid. The Cholesky factorization can be used to transform a strictly convex quadratic constraint into a norm inequality, for which t...
متن کاملRigorous Perturbation Bounds of Some Matrix Factorizations
This article presents rigorous normwise perturbation bounds for the Cholesky, LU and QR factorizations with normwise or componentwise perturbations in the given matrix. The considered componentwise perturbations have the form of backward rounding errors for the standard factorization algorithms. The used approach is a combination of the classic and refined matrix equation approaches. Each of th...
متن کاملErrors in Cholesky and QR Downdating
This paper presents a new analysis of the block downdating of a QR or Cholesky factorization in the presence of numerical errors. Let X be a block of rows of the matrix A and let A 1 be the matrix formed from the additional rows of A. Given a matrix R for which A = QR the problem is to nd ^ R such that A 1 = Q ^ R for some orthogonal Q. The given data are R and X; it is not assumed that Q is av...
متن کاملThe Equality Constrained Indefinite Least Squares Problem : Theory and Algorithms ∗ †
We present theory and algorithms for the equality constrained indefinite least squares problem, which requires minimization of an indefinite quadratic form subject to a linear equality constraint. A generalized hyperbolic QR factorization is introduced and used in the derivation of perturbation bounds and to construct a numerical method. An alternative method is obtained by employing a generali...
متن کامل